FSTTCS 2006 (foundations of software technology and theoretical computer science)Arun-Kumar, S; Garg, Naveen.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-49994-6, 1Vol, XIII-430 p, isbn 3-540-49994-6Conference Proceedings

Approximation algorithms for 2-stage stochastic optimization problemsSWAMY, Chaitanya; SHMOYS, David B.Lecture notes in computer science. 2006, pp 5-19, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 15 p.Conference Paper

Monitoring of real-time propertiesBAUER, Andreas; LEUCKER, Martin; SCHALLHART, Christian et al.Lecture notes in computer science. 2006, pp 260-272, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 13 p.Conference Paper

Hennessy-plotkin-brookes revisitedPLOTKIN, Gordon.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-49994-6, 1Vol, p. 4Conference Paper

A proof system for the linear time μ-calculusDAX, Christian; HOFMANN, Martin; LANGE, Martin et al.Lecture notes in computer science. 2006, pp 273-284, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Expressivity properties of boolean BI through relational modelsGALMICHE, Didier; LARCHEY-WENDLING, Dominique.Lecture notes in computer science. 2006, pp 357-368, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Fast edge colorings with fixed number of colors to minimize imbalanceCALINESCU, Gruia; PELSMAJER, Michael J.Lecture notes in computer science. 2006, pp 117-128, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

On reduction criteria for probabilistic reward modelsGROBER, Marcus; NORMAN, Gethin; BAIER, Christel et al.Lecture notes in computer science. 2006, pp 309-320, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Rational behaviour and strategy construction in infinite multiplayer gamesUMMELS, Michael.Lecture notes in computer science. 2006, pp 212-223, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Multi-stack boundary labeling problemsBEKOS, Michael A; KAUFMANN, Michael; POTIKA, Katerina et al.Lecture notes in computer science. 2006, pp 81-92, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

On continuous timed automata with input-determined guardsCHEVALIER, Fabrice; D'SOUZA, Deepak; PRABHAKAR, Pavithra et al.Lecture notes in computer science. 2006, pp 369-380, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Some results on average-case hardness within the polynomial hierarchyPAVAN, A; SANTHANAM, Rahul; VINODCHANDRAN, N. V et al.Lecture notes in computer science. 2006, pp 188-199, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

The meaning of ordered SOSMOHAMMADREZA MOUSAVI; PHILLIPS, Iain; RENIERS, Michel A et al.Lecture notes in computer science. 2006, pp 333-344, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Tree automata make ordinal theory easyCACHAT, Thierry.Lecture notes in computer science. 2006, pp 285-296, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Computing a center-transversal lineAGARWAL, Pankaj K; CABELLO, Sergio; SELLARES, J. Antoni et al.Lecture notes in computer science. 2006, pp 93-104, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Coresets for discrete integration and clusteringHAR-PELED, Sariel.Lecture notes in computer science. 2006, pp 33-44, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Normal and feature approximations from noisy point cloudsDEY, Tamal K; JIAN SUN.Lecture notes in computer science. 2006, pp 21-32, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

On decidability of LTL model checking for process rewrite systemsBOZZELLI, Laura; KRETINSKY, Mojmir; REHAK, Vojtech et al.Lecture notes in computer science. 2006, pp 248-259, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Solving connected dominating set faster than 2ⁿFOMIN, Fedor V; GRANDONI, Fabrizio; KRATSCH, Dieter et al.Lecture notes in computer science. 2006, pp 152-163, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Testing probabilistic equivalence through reinforcement learningDESHARNAIS, Josée; LAVIOLETTE, Francois; ZHIOUA, Sami et al.Lecture notes in computer science. 2006, pp 236-248, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 13 p.Conference Paper

Unbiased rounding of rational matricesDOERR, Benjamin; KLEIN, Christian.Lecture notes in computer science. 2006, pp 200-211, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

The number of crossing free configurations on finite point sets in the planeWELZL, Emo.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-49994-6, 1Vol, p. 20Conference Paper

Zero error list-decoding capacity of the q/ (q -1) channelCHAKRABORTY, Sourav; RADHAKRISHNAN, Jaikumar; RAGHUNATHAN, Nandakumar et al.Lecture notes in computer science. 2006, pp 129-138, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 10 p.Conference Paper

Linear-time algorithms for two subtree-comparison problems on phylogenetic trees with different speciesHSIEH, Sun-Yuan.Lecture notes in computer science. 2006, pp 164-175, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper

Hardness of approximation results for the problem of finding the stopping distance in tanner graphsMURALI KRISHNAN, K; SUNIL CHANDRAN, L.Lecture notes in computer science. 2006, pp 69-80, issn 0302-9743, isbn 3-540-49994-6, 1Vol, 12 p.Conference Paper